Combining SETL/E with Linda∗

نویسنده

  • W. Hasselbring
چکیده

SETL/E is a procedural prototyping language based on the theory of finite sets. The coordination language Linda provides a distributed shared memory model, called tuple space, together with some atomic operations on this shared data space. Process communication and synchronization in Linda is also called generative communication, because tuples are added to, removed from and read from tuple space concurrently. Synchronization is done implicitly. In this paper a proposal will be presented for enhancing the basic Linda model with multiple tuple spaces, additional nondeterminism and the facility for changing tuples in tuple space to combine set-oriented programming with generative communication: SETL/E-Linda.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ISETL-LINDA: Parallel Programming with Bags

This paper describes the parallel language ISETL-LINDA. The language is an extension of ISETL, an imperative language whose main data structure is the set. We extend ISETL by adding a new type of distributed bags, and operations to act on bags which correspond to the LINDA primitives. However, we use a variant of LINDA created at the University of York which replaces the problematic inp and rdp...

متن کامل

Linda Implementation Revisited

Linda is a model for communication and co-ordination of parallel processes. The model provides a virtual shared memory called tuple space, and primitives to place tuples into and remove tuples from tuple space. The style of programming provided by Linda is quite different to the style of, say, occam. We describe a new implementation of Linda across a network of transputers. We provide the four ...

متن کامل

Type Transformation and Data Structure Choice

Program analysis for typings, for set inclusion and membership relationships, and for universal sets to support data structure selection was a major goal of the SETL project and involved perhaps 50 person-years of design and implementation. Because that approach was so comprehensive, its data structure algorithms used heuristics leading only to expected improvements in performance. Despite seri...

متن کامل

Lazy SETL Debugging with Persistent Data Structures

To my parents and v Acknowledgments This is a good opportunity for me to thank the people who have contributed to the thesis. It is difficult to imagine that I could complete my research work without the contributions of these people. I am greatly indebted to my research advisor, Jack Schwartz. He has been my mentor and motivator since I started to work with him three years ago. His interest, i...

متن کامل

Associative Processing: A Paradigm for Massively Parallel AI

In associative memory, recall is based on similarity to a cue. With its inherent data parallelism, associative memory naturally lends itself to implementation on massively parallel hardware; it is our thesis that associative processing can serve as the basis of AI systems. We believe that the associative paradigm can encompass both neural network and symbolic applications. Current research indi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991